Coordinate Descent with Online Adaptation of Coordinate Frequencies
نویسندگان
چکیده
Coordinate descent (CD) algorithms have become the method of choice for solving a number of optimization problems in machine learning. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We consider general CD with non-uniform selection of coordinates. Instead of fixing selection frequencies beforehand we propose an online adaptation mechanism for this important parameter, called the adaptive coordinate frequencies (ACF) method. This mechanism removes the need to estimate optimal coordinate frequencies beforehand, and it automatically reacts to changing requirements during an optimization run. We demonstrate the usefulness of our ACF-CD approach for a variety of optimization problems arising in machine learning contexts. Our algorithm offers significant speed-ups over state-of-the-art training methods.
منابع مشابه
Accelerated Coordinate Descent with Adaptive Coordinate Frequencies
Coordinate descent (CD) algorithms have become the method of choice for solving a number of machine learning tasks. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We propose an extension of the CD algorithm, called the adaptive coordinate frequencies (ACF) method. This modified CD schem...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملRandomized Block Coordinate Descent for Online and Stochastic Optimization
Two types of low cost-per-iteration gradient descent methods have been extensively studied in parallel. One is online or stochastic gradient descent ( OGD/SGD), and the other is randomzied coordinate descent (RBCD). In this paper, we combine the two types of methods together and propose online randomized block coordinate descent (ORBCD). At each iteration, ORBCD only computes the partial gradie...
متن کاملTheoretical Investigation of Hyper-coordinate Planar Si Clusters in [SiMnHn]q (M = Cu, Ni and n = 4, 5, 6)
In this study, the geometries of the [SiNinHn]q and [SiCunHn]q clusters, (n = 4,5,6 and q = 0,+1,-1) complexes have been optimized to form complexes with four, five and six planar and nonplanarsubstituents, with negative, neutral or positive atomic charge, using Density FunctionalTheory (DFT) at B3LYP/6-311+G (3df, p) computational level and then their thermodynamicstability were investigated b...
متن کاملThe cyclic coordinate descent in hydrothermal optimization problems with non-regular Lagrangian
In this paper we present an algorithm, inspired by the cyclic coordinate descent method, which allows the resolution of hydrothermal optimization problems involving pumped-storage plants. The proof of the convergence of the succession generated by the algorithm was based on the use of an appropriate adaptation of Zangwill’s global theorem of convergence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1401.3737 شماره
صفحات -
تاریخ انتشار 2014